Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
نویسندگان
چکیده
منابع مشابه
Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
Given an undirected multigraph G = (V,E), a family W of sets W ⊆ V of vertices (areas), and a requirement function r : W → Z+ (where Z+ is the set of nonnegative integers), we consider the problem of augmenting G by the smallest number of new edges so that the resulting graph has at least r(W ) edge-disjoint paths between v and W for every pair of a vertex v ∈ V and an area W ∈ W. So far this p...
متن کاملUndirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation
In this paper we study properties for the structure of an undirected graph that is not vertex connected We also study the evolution of this structure when an edge is added to optimally increase the vertex connectivity of the underlying graph Several properties reported here can be extended to the case of a graph that is not k vertex connected for an arbitrary k Using properties obtained here we...
متن کاملMinimum Augmentation of Edge-Connectivity with Monotone Requirements in Undirected Graphs
For a finite ground set V , we call a set-function r : 2 → Z monotone, if r(X ′) ≥ r(X) holds for each X ′ ⊆ X ⊆ V , where Z is the set of nonnegative integers. Given an undirected multigraph G = (V,E) and a monotone requirement function r : 2 → Z, we consider the problem of augmenting G by a smallest number of new edges so that the resulting graph G′ satisfies dG′(X) ≥ r(X) for each ∅ 6= X ⊂ V...
متن کاملOn Minimum k-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree
The k-edge-connectivity augmentation problem for a specified set of vertices of a graph with degree constraints, kECA-SV-DC, is defined as follows: “Given an undirected multigraph G = (V, E), a specified set of vertices S ⊆ V and a function g : V → Z ∪ {∞}, find a smallest set E′ of edges such that (V, E ∪ E′) has at least k edge-disjoint paths between any pair of vertices in S and such that, f...
متن کاملIndependence Free Graphs and Vertex Connectivity Augmentation
Given an undirected graph G and a positive integer k, the k-vertex-connectivity augmentation problem is to find a smallest set F of new edges for which G + F is k-vertex-connected. Polynomial algorithms for this problem have been found only for k≤ 4 and a major open question in graph connectivity is whether this problem is solvable in polynomial time in general. In this paper we develop an algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2006
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.04.017